The intersection problem for cubes
نویسندگان
چکیده
For all integers m, nand t, we determine necessary and sufficient conditions for the existence of (1) a pair of 3-cube decompositions of Kn having precisely t common 3-cubes; and (2) a pair of 3-cube decompositions of Km,n having precisely t common 3-cubes.
منابع مشابه
Synthesizing cubes to satisfy a given intersection pattern
In two-level logic synthesis, the typical input specification is a set of minterms defining the on set and a set of minterms defining the don’t care set of a Boolean function. The problem is to synthesize an optimal set of product terms, or cubes, that covers all the minterms in the on set and some of the minterms in the don’t care set. In this paper, we consider a different specification: inst...
متن کاملThe μ-way intersection problem for cubes
A collection of Il 3-cube decompositions of a graph G is said to have intersection size t if there is a set S, with 181 = t, of 3-cubes which is contained in every decomposition, and no 3-cube which is not in S occurs in more than one decomposition. We determine all integers n, t and Il, with Il ::; 12, for which there exists a collection of Il 3-cube decompositions of Kn with intersection size...
متن کاملIntersection-free Contouring on An Octree Grid
A method for extracting intersection-free iso-surfaces from volumetric data with an octree structure is presented. Unlike contouring techniques designed for uniform grids (such as Marching Cubes), adaptive contouring methods (such as Dual Contouring) can and do often generate intersecting polygons. Our main contribution is a polygon generation algorithm that produces triangles enclosed in nonov...
متن کاملMarching Cubes in an Unsigned Distance Field for Surface Reconstruction from Unorganized Point Sets
Surface reconstruction from unorganized point set is a common problem in computer graphics. Generation of the signed distance field from the point set is a common methodology for the surface reconstruction. The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned natu...
متن کاملExtraction of Intersection curves from Iso-surfaces on co-located 3D grids
This paper presents new methods for efficient extraction of intersection curves between iso-surfaces of any pair of co-located 3D scalar fields. The first method is based on the Marching Cubes algorithm which has been enhanced to produce an additional data structure that makes it possible to reduce the complexity of the general surface intersection extraction from O(N) to O( √ N), where N denot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 15 شماره
صفحات -
تاریخ انتشار 1997